A quick reference for notation used in this lecture.
Key takeaway: keep symbols consistent across code and proofs.
| Term | Meaning |
|---|---|
| V, E | Vertex and edge sets of a graph |
| G[u] | Neighbors of vertex `u` (in an adjacency list) |
| level[v] | Distance in edges from start `s` (used in BFS) |
| parent[v] | Predecessor of vertex `v` in the traversal tree |
| d[v], f[v] | Discovery and finish timestamps (used in DFS) |